Heuristics Based on Unit Propagation for Satisfiability Problems
نویسندگان
چکیده
The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel combinations of unit propagation and the usual "MaximumOccurrences in clauses of Minimum Size" heuristics. Based on the experimental evaluations of di erent alternatives a new simple unit propagation based heuristic is put forward. This compares favorably with the heuristics employed in the current state-of-the-art DPL implementations (C-SAT, Tableau, POSIT).
منابع مشابه
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paper presents new results on an approach for solving satisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach has become feasible due to recent advances in Reconfigurable Computing. We develop an algorithm that is suitable for a logic circuit implementation. This algorithm i...
متن کاملExperimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
Considerable progress has been made in recent years in understanding and solving propositional satisfiabilit y problems. Much of this work has been based on experiments on randomly generated 3SAT problems . One generally accepted shortcoming of this work is that it is not clear how the results and algorithms developed will carry over to “real” constraintsatisfaction problems. This paper reports...
متن کاملExperimental Results on the Application of Satis ability Algorithmsto Scheduling Problems
Considerable progress has been made in recent years in understanding and solving propositional satissa-bility problems. Much of this work has been based on experiments on randomly generated 3SAT problems. One generally accepted shortcoming of this work is that it is not clear how the results and algorithms developed will carry over to \real" constraint-satisfaction problems. This paper reports ...
متن کاملAn Efficient Algorithm for Maximum Boolean Satisfiability Based on Unit Propagation, Linear Programming, and Dynamic Weighting
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a logical formula. A branch-and-bound algorithm based on the Davis-PutnamLogemann-Loveland procedure (DPLL) is one of the most efficient complete algorithms for solving max-SAT. In this paper, We propose an...
متن کاملExtending Sat Solver with Parity Constraints
Current methods for solving Boolean satisfiability problem (SAT) are scalable enough to solve discrete nonlinear problems involving hundreds of thousands of variables. However, modern SAT solvers scale poorly with problems involving parity constraints (linear equations modulo 2). Gaussian elimination can be used to solve a system of linear equation effectively but it cannot be applied as such w...
متن کامل